covering lemma

См. также в других словарях:

• Covering lemma — See also: Jensen s covering theorem In mathematics, under various anti large cardinal assumptions, one can prove the existence of the canonical inner model, called the Core Model, that is, in a sense, maximal and approximates the structure of V.… …   Wikipedia

• Vitali covering lemma — In mathematics, the Vitali covering lemma is a combinatorial and geometric result commonly used in measure theory of Euclidean spaces. tatement of the lemma* Finite version: Let B {1},...,B {n} be any collection of d dimensional balls contained… …   Wikipedia

• Whitney covering lemma — In mathematical analysis, the Whitney covering lemma is a lemma which asserts the existence of a certain type of partition of an open set in a Euclidean space. Originally it was employed in the proof of Hassler Whitney s extension theorem. The… …   Wikipedia

• Covering — may refer to: Mathematics In topology: Covering map, a function from one space to another with uniform local neighborhoods Cover (topology), a system of (usually, open or closed) sets whose union is a given topological space Lebesgue covering… …   Wikipedia

• Covering theorem — In mathematics, covering theorem can refer to Vitali covering lemma Jensen s covering theorem This disambiguation page lists mathematics articles associated with the same title. If an internal link led you here …   Wikipedia

• Calderón-Zygmund lemma — In mathematics, the Calderón Zygmund lemma is a fundamental result in Fourier analysis, harmonic analysis, and singular integrals. It is named for the mathematicians Alberto Calderón and Antoni Zygmund.Given an integrable function f:… …   Wikipedia

• Jensen's covering theorem — In set theory, Jensen s covering theorem states that if 0# does not exist then every uncountable set of ordinals is contained in a constructible set of the same cardinality. Informally this conclusion says that the constructible universe is close …   Wikipedia

• König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …   Wikipedia

• Noether normalization lemma — In mathematics, the Noether normalization lemma is a result of commutative algebra, introduced in (Noether 1926). A simple version states that for any field k, and any finitely generated commutative k algebra A, there exists a nonnegative integer …   Wikipedia

• Bramble-Hilbert lemma — In mathematics, particularly numerical analysis, the Bramble Hilbert lemma, named after James H. Bramble and Stephen R. Hilbert, bounds the error of an approximation of a function extstyle u by a polynomial of order at most extstyle m 1 in terms… …   Wikipedia

• Borel-Cantelli lemma — In probability theory, the Borel Cantelli lemma is a theorem about sequences of events. In a slightly more general form, it is also a result in measure theory. It is named after Émile Borel and Francesco Paolo Cantelli.Let ( E n ) be a sequence… …   Wikipedia